A Connected F-Space

Attribute-Space Connected Filters

A Degree Condition For Graphs to Have Connected (g, f)-Factors

Fixed Point Theory in $varepsilon$-connected Orthogonal Metric Space

The existence of fixed point in orthogonal metric spaces has been initiated by Eshaghi and et. al [7]. In this paper, we prove existence and uniqueness theorem of fixed point for mappings on $varepsilon$-connected orthogonal metric space. As a consequence of this, we obtain the existence and uniqueness of fixed point for analytic function of one complex variable. The paper concludes with some i...

Connected (g, f)-factors and supereulerian digraphs

Given a digraph (an undirected graph, resp.) D and two positive integers f (x); g(x) for every x 2 V (D), a subgraph H of D is called a (g; f)-factor if g(x) d + H (x) = d ? H (x) f (x)(g(x) d H (x) f (x), resp.) for every x 2 V (D). If f (x) = g(x) = 1 for every x, then a connected (g; f)-factor is a hamiltonian cycle. The previous research related to the topic has been carried out either for ...

Vertex Exponential Algorithms for Connected f-Factors

Given a graph G and a function f : V (G) → [|V (G)|], an f -factor is a subgraph H of G such that degH(v) = f(v) for every vertex v ∈ V (G); we say that H is a connected f -factor if, in addition, the subgraph H is connected. Tutte (1954) showed that one can check whether a given graph has a specified f -factor in polynomial time. However, detecting a connected f -factor is NP-complete, even wh...